The Periodic QR Algorithm is a Disguised QR Algorithm
نویسنده
چکیده
Abstract The periodic QR algorithm is a strongly backward stable method for computing the eigenvalues of products of matrices, or equivalently for computing the eigenvalues of block cyclic matrices. The main purpose of this paper is to show that this algorithm is numerically equivalent to the standard QR algorithm. It will be demonstrated how this connection may be used to develop a better understanding of the periodic QR algorithm.
منابع مشابه
Shift Blurring in the Qr Algorithm
The QR algorithm is one of the most widely used algorithms for calculating the eigenvalues of matrices. The multishift QR algorithm with multiplicity m is a version that eeects m iterations of the QR algorithm at a time. It is known that roundoo errors cause the multishift QR algorithm to perform poorly when m is large. In this paper the mechanism by which the shifts are transmitted through the...
متن کاملUnderstanding the Qr Algorithm, Part Ii
The QR algorithm is still one of the most important methods for computing eigenvalues and eigenvectors of matrices. Most discussions of the QR algorithm begin with a very basic version and move by steps toward the versions of the algorithm that are actually used. This paper outlines a pedagogical path that leads directly to the implicit multishift QR algorithms that are used in practice, bypass...
متن کاملThe QR Algorithm Revisited
The QR algorithm is still one of the most important methods for computing eigenvalues and eigenvectors of matrices. Most discussions of the QR algorithm begin with a very basic version and move by steps toward the versions of the algorithm that are actually used. This paper outlines a pedagogical path that leads directly to the implicit multishift QR algorithms that are used in practice, bypass...
متن کاملEfficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Recently, a novel LDA algorithm based on QR Decomposition, namely LDA/QR, has been proposed, which is competitive in terms of classification accuracy with other LDA algorithms, but it has much lower costs in time and spa...
متن کاملQR-like Algorithms for Eigenvalue Problems
In the year 2000 the dominant method for solving matrix eigen-value problems is still the QR algorithm. This paper discusses the family of GR algorithms, with emphasis on the QR algorithm. Included are historical remarks, an outline of what GR algorithms are and why they work, and descriptions of the latest, highly parallelizable, versions of the QR algorithm. Now that we know how to paralleliz...
متن کامل